G Minimum - Cost Flows
نویسنده
چکیده
In this final chapter on flows, we consider a significant generalization of the maximumflow problem that (as far as we know) cannot be solved by modifying the graph and applying a standard flow algorithm. The input to our problem consists of a flow network without special source and target vertices, where each edge e has a cost $(e), in addition to the usual edge capacities and vertex balances. Edge costs can be positive, negative, or zero. The total cost of any flow f is then defined as
منابع مشابه
New polynomial-time cycle-canceling algorithms for minimum-cost flows
The cycle-canceling algorithm is one of the earliest algorithms to solve the minimum cost flow problem. This algorithm maintains a feasible solution x in the network G and proceeds by augmenting flows along negative cost directed cycles in the residual network G(x) and thereby canceling them. For the minimum cost flow problem with integral data, the generic version of the cycle-canceling algori...
متن کاملCapacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances
Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...
متن کاملApproximate Minimum - Cost Multicommodity Flows in ~ O ( " � 2 Knm ) Time
We show that an "-approximate solution of the cost-constrained K-commodity ow problem on an N-nodeM-arc network G can be computed by sequentially solving O K(" 2 + logK) logM log(" 1 K) single-commodity minimum-cost ow problems on the same network. In particular, an approximate minimumcost multicommodity ow can be computed in ~ O(" 2 KNM) running time, where the notation ~ O( ) means \up to log...
متن کاملA Fuzzy Random Minimum Cost Network Flow Programming Problem
In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...
متن کاملDesigning Optimal Flow Networks∗
We investigate the problem of designing a minimum cost flow network interconnecting n sources and a single sink, each with known locations and flows. The network may contain other unprescribed nodes, known as Steiner points. For concave increasing cost functions, a minimum cost network of this sort has a tree topology, and hence can be called a Minimum Gilbert Arborescence (MGA). We characteris...
متن کامل